Fixed…Or Needs Fixing?

On the fixed number of graphs

‎A set of vertices $S$ of a graph $G$ is called a fixing set of $G$‎, ‎if only the trivial automorphism of $G$ fixes every vertex in $S$‎. ‎The fixing number of a graph is the smallest cardinality of a fixing‎ ‎set‎. ‎The fixed number of a graph $G$ is the minimum $k$‎, ‎such that ‎every $k$-set of vertices of $G$ is a fixing set of $G$‎. ‎A graph $G$‎ ‎is called a $k$-fixed graph‎, ‎if its fix...

Complement-fixing antibodies in cattle experimentally infected with Theileria annulata or vaccinated with tissue cultures

Understanding , Detecting , and Repairing Performance Bugs

Software performance is critical for how end-users perceive the quality of software products. Performance bugs—programming errors that cause performance degradation—lead to poor user experience and low system throughput. Despite advances in profiling techniques, performance bugs still escape in production runs. There are two key reasons why performance bugs are not effectively detected during i...

Thermal fixing of 10,000 Holograms in LiNbO3:Fe.

We discuss thermal fixing as a solution to the volatility problem in holographic storage systems that use photorefractive materials such as LiNbO(3):Fe. We present a systematic study to characterize the effect of thermal fixing on the error performance of a large-scale holographic memory. We introduce a novel, to our knowledge, incremental fixing schedule to improve the overall system fixing ef...

On fixable families of Boolean networks

The asynchronous dynamics associated with a Boolean network f : {0, 1} → {0, 1} is a finite deterministic automaton considered in many applications. The set of states is {0, 1}, the alphabet is [n], and the action of letter i on a state x consists in either switching the ith component if fi(x) 6= xi or doing nothing otherwise. This action is extended to words in the natural way. We then say tha...